Improved MITM Cryptanalysis on Streebog

نویسندگان

چکیده

At ASIACRYPT 2012, Sasaki et al. introduced the guess-and-determine approach to extend meet-in-the-middle (MITM) preimage attack. CRYPTO 2021, Dong proposed a technique derive solution spaces of nonlinear constrained neutral words in MITM In this paper, we try combine these two techniques further improve attacks. Based on previous MILP-based automatic tools for attacks, introduce new constraints due combination and nonlinearly build model.As proof work, apply it Russian national standard hash function Streebog, which is also an ISO standard. We find first 8.5-round attack Streebog-512 compression 7.5-round Streebog-256 function. addition, give Our attacks best by one round. time complexity 6.5-round

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sieve-in-the-Middle: Improved MITM Attacks

This paper presents a new generic technique, named sievein-the-middle, which improves meet-in-the-middle attacks in the sense that it provides an attack on a higher number of rounds. Instead of selecting the key candidates by searching for a collision in an intermediate state which can be computed forwards and backwards, we look for the existence of valid transitions through some middle sbox. C...

متن کامل

Improved Differential Cryptanalysis on Generalized Feistel Schemes

Nachef et al [12] used differential cryptanalysis to study four types of Generalized Feistel Scheme (GFS). They gave the lower bound of maximum number of rounds that is indistinguishable from a random permutation. In this paper, we study the security of several types of GFS by exploiting the asymmetric property. We show that better lower bounds can be achieved for the Type-1 GFS, Type-3 GFS and...

متن کامل

Improved Cryptanalysis of MISTY1

The block cipher MISTY1 [9] proposed for the NESSIE project [11] is a Feistel network augmented with key-dependent linear FL functions. The proposal allows a variable number of rounds provided that it is a multiple of four. Here we present a new attack – the Slicing Attack – on the 4-round version, which makes use of the special structure and position of these key-dependent linear FL functions....

متن کامل

Improved Cryptanalysis of Rijndael

We improve the best attack on Rijndael reduced to 6 rounds from complexity 2 to 2. We also present the first known attacks on 7and 8-round Rijndael. The attacks on 8-round Rijndael work for 192bit and 256-bit keys. Finally, we discuss the key schedule of Rijndael and describe a related-key attack that can break 9-round Rijndael with 256-bit keys.

متن کامل

Improved Cryptanalysis of Skein

The hash function Skein is the submission of Ferguson et al. to the NIST Hash Competition, and is arguably a serious candidate for selection as SHA-3. This paper presents the first third-party analysis of Skein, with an extensive study of its main component: the block cipher Threefish. We notably investigate near collisions, distinguishers, impossible differentials, key recovery using related-k...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IACR transaction on symmetric cryptology

سال: 2022

ISSN: ['2519-173X']

DOI: https://doi.org/10.46586/tosc.v2022.i2.63-91